Adaptive Deadlock-Free Packet Routeing in Transputer-Based Multiprocessor Interconnection Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks

Abst rac t : We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for cert~n multiprocessor interconnection networks and give their analysis in terms of the compactness and the size (the maximum number of buffers per node (per link)). The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate an...

متن کامل

Multiprocessor Interconnection Networks

A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into grou...

متن کامل

Deadlock Characterization and Resolution in Interconnection Networks

This chapter describes three important classes of deadlocking behavior that can occur in interconnection networks used in computer systems and discusses various techniques that can be used to handle them. Network attributes and phenomena that in uence the formation of network deadlocks are identi ed. Ways in which a network's susceptibility to deadlock can be reduced are presented. Advantages a...

متن کامل

Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks

We present two new packet routing algorithms for parallel computers with torus interconnection networks of arbitrary size and dimension. Both algorithms use only minimal length paths, are fully adaptive in the sense that all minimal length paths may be used to avoid congestion , and are free of deadlock, livelock and starvation. Algorithm 1 requires only three central queues per routing node. I...

متن کامل

Packet Routing in Multiprocessor Networks

Packet Routing in Multiprocessor Networks

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1991

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/34.6.493